A new approach for similarity queries using neighborhood graphs
نویسندگان
چکیده
Proximity graphs have been widely used in the area of computational geometry; through a vicinity concept these graphs establish relations of similarity between elements of a set. In this paper we propose the use of Relative Neighborhood Graph (RNG) in metric spaces in order to efficiently answer similarity queries. Additionally we introduce a new algorithm for range queries and nearest neighbor queries making use of the spatial approximation in graphs. Experiments show that our proposal has a comparable performance in terms of Number of Distance Calculations (NDC) and time.
منابع مشابه
A new approach for similarity queries using proximity graphs
Proximity graphs have been widely used in the area of computational geometry; through a vicinity concept these graphs establish relations of similarity between elements of a set. In this paper we propose the use of Relative Neighborhood Graph (RNG) in metric spaces in order to efficiently answer similarity queries. Additionally we introduce a new algorithm for range queries and nearest neighbor...
متن کاملProviding a Link Prediction Model based on Structural and Homophily Similarity in Social Networks
In recent years, with the growing number of online social networks, these networks have become one of the best markets for advertising and commerce, so studying these networks is very important. Most online social networks are growing and changing with new communications (new edges). Forecasting new edges in online social networks can give us a better understanding of the growth of these networ...
متن کاملSpectra of some new extended corona
For two graphs $mathrm{G}$ and $mathrm{H}$ with $n$ and $m$ vertices, the corona $mathrm{G}circmathrm{H}$ of $mathrm{G}$ and $mathrm{H}$ is the graph obtained by taking one copy of $mathrm{G}$ and $n$ copies of $mathrm{H}$ and then joining the $i^{th}$ vertex of $mathrm{G}$ to every vertex in the $i^{th}$ copy of $mathrm{H}$. The neighborhood corona $mathrm{G}starmathrm{H}$ of $mathrm{G}$ and $...
متن کاملIQPI: An Incremental System for Answering Imprecise Queries Using Approximate Dependencies and Concept Similarities
Most of the proposed systems to process queries over web databases require the user to provide some information regarding the relative importance of attributes and the similarities between nominal values. Recently, a new system called AIMQ has been proposed, which is based on measuring concept similarities. This system is end-user independent and can answer imprecise queries. The main drawback ...
متن کاملOrthant neighborhood graphs - a decentralized approach for proximity queries in dynamic point sets
This work presents a novel approach for proximity queries in dynamic point sets, a common problem in computer graphics. We introduce the notion of Orthant Neighborhood Graphs, yielding a simple, decentralized spatial data structure based on weak spanners. We present efficient algorithms for dynamic insertions, deletions and movements of points, as well as range searching and other proximity que...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007